Local chromatic number of quadrangulations of surfaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local chromatic number of quadrangulations of surfaces

The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological ...

متن کامل

k-Chromatic Number of Graphs on Surfaces

A well-known result (Heawood [6], Ringel [11], Ringel and Youngs [10]) states that the maximum chromatic number of a graph embedded in a given surface S coincides with the size of the largest clique that can be embedded in S, and that this number can be expressed as a simple formula in the Eulerian genus of S. We study maximum chromatic number of k edge-disjoint graphs embedded in a surface. We...

متن کامل

Realizing the Chromatic Numbers and Orders of Spinal Quadrangulations of Surfaces

A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G. Ringel’s results [J. Comb. Theory, Ser. B 46 (1989), 84-95] are generalized by way of generating minimal quadrangulations of infinitely many other genera.

متن کامل

The locating chromatic number of the join of graphs

‎Let $f$ be a proper $k$-coloring of a connected graph $G$ and‎ ‎$Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into‎ ‎the resulting color classes‎. ‎For a vertex $v$ of $G$‎, ‎the color‎ ‎code of $v$ with respect to $Pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$‎, ‎where $d(v,V_i)=min{d(v,x):~xin V_i}‎, ‎1leq ileq k$‎. ‎If‎ ‎distinct...

متن کامل

Local structure of random quadrangulations

This paper is an adaptation of a method used in [10] to the model of random quadrangulations. We prove local weak convergence of uniform measures on quadrangulations and show that the local growth of quadrangulation is governed by certain critical time-reversed branching process and the rescaled profile converges to the reversed continuous-state branching process. As an intermediate result we d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2013

ISSN: 0209-9683,1439-6912

DOI: 10.1007/s00493-013-2771-y